KDE-Track: An Efficient Dynamic Density Estimator for Data Streams
نویسندگان
چکیده
منابع مشابه
Efficient Similarity Search in Dynamic Data Streams
The Jaccard index is an important similarity measure for item sets and Boolean data. On large datasets, an exact similarity computation is often infeasible for all item pairs both due to time and space constraints, giving rise to faster approximate methods. The algorithm of choice used to quickly compute the Jaccard index |A∩B| |A∪B| of two item sets A and B is usually a form of min-hashing. Mo...
متن کاملA Berry-Esseen Type Bound for the Kernel Density Estimator of Length-Biased Data
Length-biased data are widely seen in applications. They are mostly applicable in epidemiological studies or survival analysis in medical researches. Here we aim to propose a Berry-Esseen type bound for the kernel density estimator of this kind of data.The rate of normal convergence in the proposed Berry-Esseen type theorem is shown to be O(n^(-1/6) ) modulo logarithmic term as n tends to infin...
متن کاملAn Efficient Ensemble Method for Classifying Skewed Data Streams
Class distributions of data streams in real application are usually unbalanced, they are hence called Skewed Data Streams (abbreviated as SDS). However, in the classification of SDS, it is a challenge for traditional methods because of the difficulty in the recognition of minority classes. Therefore, many approaches have been proposed to improve the recognition rate of minority classes, while t...
متن کاملDensity Estimation over Data Streams
A growing number of real-world applications share the property that they have to deal with transient data arriving in massive volumes, so-called data streams. The characteristics of these data streams render their analysis by means of conventional techniques extremely difcult, in the majority of cases even impossible. In fact, to be applicable to data streams, a technique has to meet rigid proc...
متن کاملCost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing focus of applications that generate and receive data streams stimulates the need for online data stream analysis tools. Mining data streams is a real time process of extracting interesting patterns from high-speed dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2017
ISSN: 1041-4347
DOI: 10.1109/tkde.2016.2626441